Some remarks on Laplacian eigenvalues and Laplacian energy of graphs
نویسندگان
چکیده
Suppose μ1, μ2, ... , μn are Laplacian eigenvalues of a graph G. The Laplacian energy of G is defined as LE(G) = ∑n i=1 |μi − 2m/n|. In this paper, some new bounds for the Laplacian eigenvalues and Laplacian energy of some special types of the subgraphs of Kn are presented. AMS subject classifications: 05C50
منابع مشابه
Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs
Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملSeidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملOn Relation between the Kirchhoff Index and Laplacian-Energy-Like Invariant of Graphs
Let G be a simple connected graph with n ≤ 2 vertices and m edges, and let μ1 ≥ μ2 ≥...≥μn-1 >μn=0 be its Laplacian eigenvalues. The Kirchhoff index and Laplacian-energy-like invariant (LEL) of graph G are defined as Kf(G)=nΣi=1n-1<...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کامل